Metaheuristic Algorithms for the Many-to-one IRP with Dynamic Velocity
نویسندگان
چکیده
منابع مشابه
METAHEURISTIC ALGORITHMS FOR MINIMUM CROSSING NUMBER PROBLEM
This paper presents the application of metaheuristic methods to the minimum crossing number problem for the first time. These algorithms including particle swarm optimization, improved ray optimization, colliding bodies optimization and enhanced colliding bodies optimization. For each method, a pseudo code is provided. The crossing number problem is NP-hard and has important applications in eng...
متن کاملMany-to-one Matchings with Lower Quotas: Algorithms and Complexity
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G = (A∪̇P,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P . We seek a maximum weight many-toone matching satisfying two sets of constraints: vertices in A are incident to at most one matching edge, while vertices in P are either ...
متن کاملOne-to-One and One-to-Many Node-Disjoint Routing Algorithms for RTCC Networks
Recently, routing with disjoint paths has received much attention because disjoint paths have the advantages of efficiency and fault tolerance. On the other hand, RTCC network was studied, due to its favorable properties such as high degree of stability and resilience. In this paper we studied the oneto-one and one-to-many disjoint routings for RTCC network. The connectivity of a network is an ...
متن کاملFrom One Session to Many: Dynamic Tags for Security Protocols
The design and verification of cryptographic protocols is a notoriously difficult task, even in abstract Dolev-Yao models. This is mainly due to several sources of unboundedness (size of messages, number of sessions, . . . ). In this paper, we characterize a class of protocols for which secrecy for an unbounded number of sessions is decidable. More precisely, we present a simple transformation ...
متن کاملUsing Metaheuristic Algorithms Combined with Clustering Approach to Solve a Sustainable Waste Collection Problem
Sustainability is a monumental issue that should be considered in designing a logistics system. In order to incorporate sustainability concepts in our study, a waste collection problem with economic, environmental, and social objective functions was addressed. The first objective function minimized overall costs of the system, including establishment of depots and treatment facilities. Addressi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2020
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1501/1/012009